Set Stability and Set Stabilization of Boolean Control Networks Avoiding Undesirable Set
نویسندگان
چکیده
The traditional set stability of Boolean networks (BNs) refers to whether all the states can converge a given state subset. Different from existing results, investigated in this paper is initial destination set. This studies and stabilization avoiding undesirable sets BNs control (BCNs), respectively. First, by virtue semi-tensor product (STP) matrices, dynamics are established. Then, reachability an investigated, Furthermore, BCNs investigated. Finally, design method for finding time optimal stabilizer proposed, example provided illustrate effectiveness results.
منابع مشابه
A RELATION BETWEEN THE CATEGORIES Set * , SetT, Set AND SetT
In this article, we have shown, for the add-point monad T, thepartial morphism category Set*is isomorphic to the Kleisli category SetT. Alsowe have proved that the category, SetT, of T-algebras is isomorphic to thecategory Set of pointed sets. Finally we have established commutative squaresinvolving these categories.
متن کاملSingleton free set partitions avoiding a 3-element set
The definition and study of pattern avoidance for set partitions, which is an analogue of pattern avoidance for permutations, begun with Klazar. Sagan continued his work by considering set partitions which avoids a single partition of three elements, and Goyt generalized these results by considering partitions which avoids any family of partitions of a 3-element set. In this paper we enumerate ...
متن کاملInference and Learning of Boolean Networks using Answer Set Programming
A Boolean Network is a compact mathematical representation of biological systems widely used in bioinformatics. However, in practice, experiments are usually not sufficient to infer a Boolean network which represents the whole biological system. Previous works relied on inferring and learning techniques to complete those models, or to learn new networks satisfying experimental properties repres...
متن کاملPattern-Avoiding Set Partitions and Catalan Numbers
We identify several subsets of the partitions of [n], each characterized by the avoidance of a pair of patterns, respectively of lengths four and five. Each of the classes we consider is enumerated by the Catalan numbers. Furthermore, the members of each class having a prescribed number of blocks are enumerated by the Narayana numbers. We use both algebraic and combinatorial methods to establis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9222864